首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   1281763篇
  免费   29781篇
  国内免费   7622篇
化学   633991篇
晶体学   14511篇
力学   73855篇
综合类   102篇
数学   240412篇
物理学   356295篇
  2021年   13471篇
  2020年   16038篇
  2019年   16189篇
  2018年   12137篇
  2016年   27888篇
  2015年   20959篇
  2014年   30619篇
  2013年   74785篇
  2012年   36324篇
  2011年   31561篇
  2010年   36281篇
  2009年   38964篇
  2008年   31401篇
  2007年   26509篇
  2006年   33565篇
  2005年   25514篇
  2004年   27288篇
  2003年   26115篇
  2002年   27498篇
  2001年   25204篇
  2000年   22888篇
  1999年   21620篇
  1998年   20718篇
  1997年   20268篇
  1996年   19117篇
  1995年   18474篇
  1994年   18001篇
  1993年   17535篇
  1992年   17033篇
  1991年   17315篇
  1990年   16531篇
  1989年   16629篇
  1988年   16218篇
  1987年   16267篇
  1986年   15127篇
  1985年   21697篇
  1984年   23141篇
  1983年   19321篇
  1982年   21106篇
  1981年   20343篇
  1980年   19646篇
  1979年   19778篇
  1978年   21223篇
  1977年   20831篇
  1976年   20513篇
  1975年   19191篇
  1974年   18801篇
  1973年   19333篇
  1972年   13868篇
  1967年   12310篇
排序方式: 共有10000条查询结果,搜索用时 218 毫秒
991.
An explicit way for producing invariants for 6-valent graphs with rigid vertices within the framework of Kauffman's approach to graph invariants is presented. These invariants can be used to detect the chirality of a 6-valent graph with rigid vertices. A relevant example is considered. Bibliography: 19 titles. Translated fromZapiski Nauchnykh Seminarov POMI, Vol. 223, 1995, pp. 251–262. Translated by A. M. Nikitin  相似文献   
992.
993.
ASTRASSENLAWOFTHEITERATEDLOGARITHMFORPROCESSESWITHINDEPENDENTINCREMENTWangJiagangAbstractLetX={X(t),t0}beaproceswithindep...  相似文献   
994.
995.
In a previous paper (Ref. 1), an exact solution of the optimal planar interception with fixed end conditions was derived in closed form. The optimal control was expressed as an explicit function of the state variables and two fixed parameters, obtained by solving a set of nonlinear algebraic equations involving elliptic integrals. In order to facilitate the optimal control implementation, the present paper derives a highly accurate simplified solution assuming that the ratio of the pursuer turning radius to the initial range is small. An asymptotic expansion further reduces the computational workload. Construction of a near-optimal open-loop control, based on the approximations, completes the present paper.  相似文献   
996.
997.
We consider the method of normal forms, the Bogolyubov averaging method, and the method of asymptotic decomposition proposed by Yu. A. Mitropol’skii and the author of this paper. Under certain assumptions about group-theoretic properties of a system of zero approximation, the results obtained by the method of asymptotic decomposition coincide with the results obtained by the method of normal forms or the Bogolyubov averaging method. We develop a new algorithm of asymptotic decomposition by a part of the variables and its partial case — the algorithm of averaging on a compact Lie group. For the first time, it became possible to consider asymptotic expansions of solutions of differential equations on noncommutative compact groups.  相似文献   
998.
This paper deals mainly with generalizations of results in finitary combinatorics to infinite ordinals. It is well-known that for finite ordinals ∑bT<αβ is the number of 2-element subsets of an α-element set. It is shown here that for any well-ordered set of arbitrary infinite order type α, ∑bT<αβ is the ordinal of the set M of 2-element subsets, where M is ordered in some natural way. The result is then extended to evaluating the ordinal of the set of all n-element subsets for each natural number n ≥ 2. Moreover, series ∑β<αf(β) are investigated and evaluated, where α is a limit ordinal and the function f belongs to a certain class of functions containing polynomials with natural number coefficients. The tools developed for this result can be extended to cover all infinite α, but the case of finite α appears to be quite problematic.  相似文献   
999.
We give various representations of asymptotics for the probability for a Wiener process to reside within a curvilinear strip during extended time intervals.  相似文献   
1000.
We present a new data structure for a set of n convex simply-shaped fat objects in the plane, and use it to obtain efficient and rather simple solutions to several problems including (i) vertical ray shooting—preprocess a set of n non-intersecting convex simply-shaped flat objects in 3-space, whose xy-projections are fat, for efficient vertical ray shooting queries, (ii) point enclosure—preprocess a set C of n convex simply-shaped fat objects in the plane, so that the k objects containing a query point p can be reported efficiently, (iii) bounded-size range searching— preprocess a set C of n convex fat polygons, so that the k objects intersecting a “not-too-large” query polygon can be reported efficiently, and (iv) bounded-size segment shooting—preprocess a set C as in (iii), so that the first object (if exists) hit by a “not-too-long” oriented query segment can be found efficiently. For the first three problems we construct data structures of size O(λs(n)log3n), where s is the maximum number of intersections between the boundaries of the (xy-projections) of any pair of objects, and λs(n) is the maximum length of (n, s) Davenport-Schinzel sequences. The data structure for the fourth problem is of size O(λs(n)log2n). The query time in the first problem is O(log4n), the query time in the second and third problems is O(log3n + klog2n), and the query time in the fourth problem is O(log3n).

We also present a simple algorithm for computing a depth order for a set as in (i), that is based on the solution to the vertical ray shooting problem. (A depth order for , if exists, is a linear order of , such that, if K1, K2 and K1 lies vertically above K2, then K1 precedes K2.) Unlike the algorithm of Agarwal et al. (1995) that might output a false order when a depth order does not exist, the new algorithm is able to determine whether such an order exists, and it is often more efficient in practical situations than the former algorithm.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号